2 References

11 set name Theorem_Tc1_2_1_1 prove in(d', funcSpace(Node, NatInf)) set name Theorem_TC_2_1_1_1 prove (in(v_k_, openInter(((d@v_m_c)+1), (d@v_n_c))) => in(v_k_,NatInf)) resume by => <> 1 subgoal for proof of => normalize Theorem_TC_2_1_1_1ImpliesHyp with UseOpenInterval ] => subgoal ] conjecture set name Theorem_TC_2_1_1 normalize Theorem_TC_2ImpliesHyp.2 with TC normalize Theorem_TC_2_1ImpliesHyp with N12 apply ProveFuncSpaceUpdateIn to Theorem_TC_2ImpliesHyp.2 Theorem... ] conjecture Fig.5. Translator output for step h3i1 in the proof of step h1i2 of Figure 4. reasoning will be veriied automatically by a decision procedure for propositional temporal logic. Some steps might be proved with a model checker by enumerating all possibilities. We may also investigate the use of theorem provers other than LP as \back ends" for the translator.